When a digraph and its line digraph are connected and cospectral

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algebraic properties of a digraph and its line digraph

Let G be a digraph, LG its line digraph and A(G) and A(LG) their adjacency matrices. We present relations between the Jordan Normal Form of these two matrices. Besides, we study the spectra of those matrices and obtain a relationship between their characteristic polynomials that allows to relate properties of G and LG regarding the number of cycles of a given length.

متن کامل

Digraph Decompositions and Monotonicity in Digraph Searching

We consider monotonicity problems for graph searching games. Variants of these games – defined by the type of moves allowed for the players – have been found to be closely connected to graph decompositions and associated width measures such as pathor tree-width. Of particular interest is the question whether these games are monotone, i.e. whether the cops can catch a robber without ever allowin...

متن کامل

Relations between connected and self-avoiding walks in a digraph

Walks in a directed graph can be given a partially ordered structure that extends to possibly unconnected objects, called hikes. Studying the incidence algebra on this poset reveals unsuspected relations between walks and self-avoiding hikes. These relations are derived by considering truncated versions of the characteristic polynomial of the weighted adjacency matrix, resulting in a collection...

متن کامل

Independent restricted domination and the line digraph

Let H be a digraph possibly with loops and let D be a digraph whose arcs are colored with the vertices of H (an H-colored digraph). A walk (path) P in D will be called an H-restricted walk (path) if the colors displayed on the arcs of P form a walk in H. An H-restricted kernel N is a set of vertices of D such that for every two different vertices in N there is no H-restricted path in D joining ...

متن کامل

A characterization of the adjacency matrix of the line digraph of a regular digraph

A characterization of the adjacency matrix of the line digraph of a regular digraph is given. Some corollaries are observed.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1998

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(97)00200-8